Finite alphabet iterative decoders for LDPC codes surpassing floating-point iterative decoders
نویسندگان
چکیده
منابع مشابه
Finite Alphabet Iterative Decoders - Part II: Towards Guaranteed Error Correction of LDPC Codes via Iterative Decoder Diversity
Recently, we introduced a new class of finite alphabet iterative decoders (FAIDs) for low-density parity-check (LDPC) codes. These decoders are capable of surpassing belief propagation in the error floor region on the Binary Symmetric channel with much lower complexity. In this paper, we introduce a a novel scheme to further increase the guaranteed error correction capability from what is achie...
متن کاملIterative Decoders for Multiuser 1S1
The goal of this work is to design and analyze the performance of various multiuser coding and iterative decoding methods for inter-symbol interference(ISI) networks. The introduction of turbo coding and iterative decoding [1] schemes have changed the coding and detection landscape drastically. The research efforts on turbo and turbo-like techniques continue on many fronts including deep-space ...
متن کاملEfficient FPGA-based Architectures of Finite Alphabet Iterative Decoders for Flash Memories
We present finite alphabet iterative decoders (FAIDs) for hard-decision decoding and 2-bit precision softdecision decoding of column-weight-four low-density paritycheck (LDPC) codes which are applicable for flash memories, and discuss their hardware implementations on FPGA. We show that 3-bit FAIDs provide superior error-rate performance in the error floor compared to 4-bit and 5-bit offset-min...
متن کاملFinite Alphabet Iterative Decoders, Part I: Decoding Beyond Belief Propagation on BSC
We introduce a new paradigm for finite precision iterative decoding on low-density parity-check codes over the Binary Symmetric channel. The messages take values from a finite alphabet, and unlike traditional quantized decoders which are quantized versions of the Belief propagation (BP) decoder, the proposed finite alphabet iterative decoders (FAIDs) do not propagate quantized probabilities or ...
متن کاملOn Generalized LDPC Codes and Their Decoders
We first consider the design of generalized LPDC (G-LDPC) codes with recursive systematic convolutional (RSC) constraint nodes in place of the standard single parity-check constraint nodes. Because rate-1/2 RSC nodes lead to low-rate G-LDPC codes, we consider high-rate tail-biting RSC nodes for which Riedel’s APP-decoder based on the reciprocal-dual code trellis becomes necessary. We then consi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics Letters
سال: 2011
ISSN: 0013-5194
DOI: 10.1049/el.2011.1184